1547D - Co-growing Sequence - CodeForces Solution


bitmasks constructive algorithms greedy *1300

Please click on ads to support us..

Python Code:

def f(x, y):
    return x & ~y

t = int(input())
for tt in range(t):
    n = int(input())
    a = list(map(int, input().split()))

    ans = [0] * n
    for i in range(1, n):
        ans[i] = f(ans[i - 1] ^ a[i - 1], a[i])
    print(" ".join(map(str, ans)))

C++ Code:

#include <iostream>
#include <vector>
using namespace std;
typedef long long ll;
int main()
{
    ios_base::sync_with_stdio(false);cin.tie(NULL);
    int tc;
    cin>>tc;
    while(tc--){
        int n;
        cin>>n;
        vector<ll> a(n);
        for(int i=0;i<n;i++){
            cin>>a[i];
        }
        vector<ll> ans(1);
        for(int i=1;i<n;i++){
            ll x=a[i-1];
            for(int k=0;k<=30;k++){
                ll tmp=1<<k;
                if((a[i]&tmp)>0&&(a[i-1]&tmp)>0)
                    x-=tmp;
            }
            a[i]^=x;
            ans.push_back(x);
        }
        for(ll num: ans)
            cout<<num<<' ';
        cout<<'\n';
    }

    return 0;
}


Comments

Submit
0 Comments
More Questions

227B - Effective Approach
1534B - Histogram Ugliness
1611B - Team Composition Programmers and Mathematicians
110A - Nearly Lucky Number
1220B - Multiplication Table
1644A - Doors and Keys
1644B - Anti-Fibonacci Permutation
1610A - Anti Light's Cell Guessing
349B - Color the Fence
144A - Arrival of the General
1106A - Lunar New Year and Cross Counting
58A - Chat room
230A - Dragons
200B - Drinks
13A - Numbers
129A - Cookies
1367B - Even Array
136A - Presents
1450A - Avoid Trygub
327A - Flipping Game
411A - Password Check
1520C - Not Adjacent Matrix
1538B - Friends and Candies
580A - Kefa and First Steps
1038B - Non-Coprime Partition
43A - Football
50A - Domino piling
479A - Expression
1480A - Yet Another String Game
1216C - White Sheet